Dynamic Cage Survey

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Cage Survey

A (k, g)-cage is a k-regular graph of girth g of minimum order. In this survey, we present the results of over 50 years of searches for cages. We present the important theorems, list all the known cages, compile tables of current record holders, and describe in some detail most of the relevant constructions. the electronic journal of combinatorics (2013), #DS16 1

متن کامل

Dynamic Breaking in Cage Induction Motor

In this paper, short circuit analysis, based on the electromagnetic transient program (EMTP), has been used to investigate the behavior of the DC reactor type FCL installed in an electrical distribution grid. System studies show that the DC reactor type FCL can not only limit the fault current to an acceptable value, but also can mitigate the voltage sag. A DC reactor type fault current limiter...

متن کامل

Dynamic Folding Pathway Models of the Trp-Cage Protein

Using action-derived molecular dynamics (ADMD), we study the dynamic folding pathway models of the Trp-cage protein by providing its sequential conformational changes from its initial disordered structure to the final native structure at atomic details. We find that the numbers of native contacts and native hydrogen bonds are highly correlated, implying that the native structure of Trp-cage is ...

متن کامل

Designing and defining dynamic protein cage nanoassemblies in solution

Central challenges in the design of large and dynamic macromolecular assemblies for synthetic biology lie in developing effective methods for testing design strategies and their outcomes, including comprehensive assessments of solution behavior. We created and validated an advanced design of a 600-kDa protein homododecamer that self-assembles into a symmetric tetrahedral cage. The monomeric uni...

متن کامل

Dynamic Auctions: a Survey

We survey the recent literature on designing auctions and mechanisms for dynamic settings. Two settings are considered: those with a dynamic population of agents whose private information remains fixed throughout time; and those with a fixed population of agents whose private information changes across time. Within each of these settings, we discuss both efficient (welfare-maximizing) and optim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2011

ISSN: 1077-8926

DOI: 10.37236/37